Computationally Equivalent Elimination of Conditions
نویسندگان
چکیده
An automatic and easy to implement transformation of conditional term rewrite systems into computationally equivalent unconditional term rewrite systems is presented. No special support is needed from the underlying unconditional rewrite engine. Since unconditional rewriting is more amenable to parallelization, our transformation is expected to lead to efficient concurrent implementations of rewriting.
منابع مشابه
Bezalel Peleg , Hans Peters Choosing k from m : feasible elimination procedures reconsidered RM / 14 / 033
We show that feasible elimination procedures (Peleg, 1978) can be used to select k from m alternatives. An important advantage of this method is the core property: no coalition can guarantee an outcome that is preferred by all its members. We also provide an axiomatic characterization for the case k = 1, using the conditions of anonymity, Maskin monotonicity, and independent blocking. Finally, ...
متن کاملChoosing k from m: Feasible elimination procedures reconsidered
We show that feasible elimination procedures (Peleg, 1978) can be used to select k from m alternatives. An important advantage of this method is the core property: no coalition can guarantee an outcome that is preferred by all its members. We also show that the problem of determining whether a specific k-tuple can result from a feasible elimination procedure is computationally equivalent to the...
متن کاملApplication of Recursive Least Squares to Efficient Blunder Detection in Linear Models
In many geodetic applications a large number of observations are being measured to estimate the unknown parameters. The unbiasedness property of the estimated parameters is only ensured if there is no bias (e.g. systematic effect) or falsifying observations, which are also known as outliers. One of the most important steps towards obtaining a coherent analysis for the parameter estimation is th...
متن کاملOn Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelingsú
The erb nu -Ro u transformation, a computationally equivalent transformation proposed by erb nu and Ro u, converts a left-linear confluent normal conditional term rewriting system (CTRS) into an unconditional term rewriting system (TRS) which is computationally equivalent to the original CTRS. This paper aims at investigating su cient conditions for soundness of the erb nu -Ro u transformation ...
متن کاملA Nurse Scheduling Model under Real Life Constraints
Background and Objectives: In this paper, a real life nurse scheduling model is described based on the conditions in Iranian hospitals such as monthly shift rotation, consecutive morning and evening shifts and consecutive evening and night shift. Methods: The developed model considers both hospital constraints and nurses’ preferences. Hospital constraints include assigning adequate qualifie...
متن کامل